A survey and annotated bibliography of multiobjective combinatorial optimization Multikriterielle Kombinatorische Optimierung: Übersicht und Kommentierte Bibliographie

نویسندگان

  • Matthias Ehrgott
  • Xavier Gandibleux
چکیده

This paper provides a survey of the research in and an annotated bibliography of multiple objective combinatorial optimization, MOCO. We present a general formulation of MOCO problems, describe the main characteristics of MOCO problems, and review the main properties and theoretical results for these problems. The main parts of the paper are a section on the review of the available solution methodology, both exact and heuristic, and a section on the annotation of the existing literature in the field organized problem by problem. We conclude the paper by stating open questions and areas of future research. Zusammenfassung. Der Artikel bietet einen Überblick und eine kommentierte Bibliographie über die Forschung in multikriterieller kombinatorischer Optimierung (MOCO, multiple objective combinatorial optimization). Wir stellen eine allgemeine Formulierung von MOCO Problemen vor, beschreiben die wichtigsten Charakteristika und Eigenschaften solcher Probleme und fassen die wesentlichen theoretischen Ergebnisse in diesem Forschungsgebiet zusammen. Die Hauptteile des Artikels sind die Abschnitte 4 über exakte und heuristsiche Lösungsverfahren und 6, der – problemweise untergliedert – die vorhandene Literatur kommentiert. Am Ende des Artikels steht ein Abschnitt zu offenen Fragen und Richtungen für zukünftige Forschung. On leave from Department of Mathematics, University of Kaiserslautern, PO Box 3049, 67653 Kaiserslautern, Germany (e-mail: [email protected]) Correspondence to: M. Ehrgott 426 M. Ehrgott and X. Gandibleux

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Annotated Bibliography of Multiobjective Combinatorial Optimization

This paper provides an annotated bibliography of multiple objective combinatorial optimization, MOCO. We present a general formulation of MOCO problems, describe the main characteristics of MOCO problems, and review the main properties and theoretical results for these problems. One section is devoted to a brief description of the available solution methodology, both exact and heuristic. The ma...

متن کامل

Ant Colony Optimization in Multiobjective Portfolio Selection

Multiobjective decision-making and combinatorial optimization have been studied extensively over the past few decades (cf. [16], and [4] for bibliographies). Both fields play a decisive role in multiobjective combinatorial optimization, for which the class of (multiobjective) portfolio selection is of particularly high practical relevance (cf. [10] for a survey). Research and development (R&D) ...

متن کامل

Anforderungen an Entscheidungsunterstützungssysteme zur optimierten Planung in der Energiewirtschaft

Aufgrund der Fortschritte in der Hardware und den Optimierungsalgorithmen ist es möglich, stetig komplexere Entscheidungsmodelle zur Planung in der Energiewirtschaft einzusetzen. Um diese Modelle im operativen Ablauf nutzen zu können, bedarf es einer Einbettung der Optimierung in Entscheidungsunterstützungssysteme, die eine Planung im Sinne der übergeordneten Unternehmensziele gestatten. In die...

متن کامل

Robustness in Combinatorial Optimization and Scheduling Theory: an Extended Annotated Bibliography Yury Nikulin

This work is an up-to-date-extension of a previous annotated bibliography (2004) which covered 40 references only. It focuses on what has been published during the last ten years in the area of combinatorial optimization and scheduling theory concerning robustness and other similar techniques dealing with worst case optimization under uncertainty and non-accuracy of problem data.

متن کامل

Grasp: an Annotated Bibliography

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000